Stratified balanced search trees

Balanced Binary Search Trees

University of Southern Denmark 10.

Balanced Search Trees Made

Balanced Search Trees Made Simple

As a contribution to the recent debate on simple implementa tions of dictionaries we present new maintenance algorithms for balanced trees In terms of code simplicity our algorithms compare favourably with those for deterministic and probabilistic skip lists

Simple Balanced Binary Search Trees

Efficient implementations of sets and maps (dictionaries) are important in computer science, and balanced binary search trees are the basis of the best practical implementations. Pedagogically, however, they are often quite complicated, especially with respect to deletion. I present complete code (with justification and analysis not previously available in the literature) for a purely-functiona...

Finger Search on Balanced Search Trees

This thesis introduces the concept of a heterogeneous decomposition of a balanced search tree and apply it to the following problems: • How can finger search be implemented without changing the representation of a Red-Black Tree, such as introducing extra storage to the nodes? (Answer: Any degree-balanced search tree can support finger search without modification in its representation by mainta...